package BinaryTree;

public class PrintDirectionOfPaper {
    public static void printAllFolding(int n){
        process(1, n, true);
    }

    //i 层数， n 总层数， down = true，凹; false, 凸。
    private static void process(int i, int n, boolean down) {
        if(i>n) return;
        process(i+1, n, true);
        System.out.println(down?"凹":"凸");
        process(i+1, n, false);
    }

    public static void main(String[] args) {
        printAllFolding(3);
    }
}
